Continuous Switch Model and Heuristics for Mixed- Integer Problems in Power Systems
نویسندگان
چکیده
منابع مشابه
Feasibility Pump-like heuristics for mixed integer problems
Finding a feasible solution to aMIP problem is a tough task that has receivedmuch attention in the last decades. The Feasibility Pump (FP) is a heuristic for finding feasible solutions to MIP problems that has encountered a lot of success as it is very efficient also when dealing with very difficult instances. In this work, we show that the FP heuristic for general MIP problems can be seen as t...
متن کاملCombining Model-Based EAs for Mixed-Integer Problems
A key characteristic of Mixed-Integer (MI) problems is the presence of both continuous and discrete problem variables. These variables can interact in various ways, resulting in challenging optimization problems. In this paper, we study the design of an algorithm that combines the strengths of LTGA and iAMaLGaM: state-of-the-art model-building EAs designed for discrete and continuous search spa...
متن کاملUsing mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused damage. We present computation with networks with up to 600 nodes and 827 edges, and many thousands of damage scenarios. 1 Partially funded by NSF award 0521741.
متن کاملA mixed integer programming model for optimal fault section estimation in power systems
This paper proposes a methodology to deal with the fault section estimation problem in electrical power systems. The main motivation for this study lies in the fact that operators of control centers usually are subject to information overload during great contingencies. The fault diagnosis is formulated as an optimization problem and solved through two stages: classification of events at equipm...
متن کاملSemi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4257476